Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Processus séquentiel communicant")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 135

  • Page / 6
Export

Selection :

  • and

CSP : communicating sequential processes : the first 25 years (London, 7-8 July 2004, revised invited papers)Abdallah, Ali E; Jones, Cliff B; Sanders, Jeff W et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-25813-2, XIV, 320 p, isbn 3-540-25813-2Conference Proceedings

Recursive process definitions with the state operatorBAETEN, J. C. M; BERGSTRA, J. A.Theoretical computer science. 1991, Vol 82, Num 2, pp 285-302, issn 0304-3975, 18 p.Article

An efficient technique for deadlock analysis of large scale process networksMARTIN, J. M. R; JASSIM, S. A.Lecture notes in computer science. 1997, pp 418-441, issn 0302-9743, isbn 3-540-63533-5Conference Paper

Relating may and must testing semantics for discrete timed process algebrasLLANA DIAZ, L. F; DE FRUTOS ESCRIG, D.Lecture notes in computer science. 1999, pp 74-86, issn 0302-9743, isbn 3-540-66856-XConference Paper

Implementing a model checker for LEGOYU, S; LUO, Z.Lecture notes in computer science. 1997, pp 442-458, issn 0302-9743, isbn 3-540-63533-5Conference Paper

Protocoles pour le rendez-vous et l'équité = Protocols for rendez-vous and fairnessPandolfi, Xavier; Jorrand, Philippe.1992, 97 p.Thesis

A compositional proof system for shared variable concurrencyDE BOER, F. S; HANNEMANN, U; DE ROEVER, W.-P et al.Lecture notes in computer science. 1997, pp 515-532, issn 0302-9743, isbn 3-540-63533-5Conference Paper

Using a PVS embedding of CSP to verify authentication protocolsDUTERTRE, B; SCHNEIDER, S.Lecture notes in computer science. 1997, pp 121-136, issn 0302-9743, isbn 3-540-63379-0Conference Paper

On communicating sequential processesPANDEY, B. D; PATHAK, S. S.Computer networks and ISDN systems. 1995, Vol 27, Num 9, pp 1333-1348, issn 0169-7552Article

Scheduling algebraVAN GLABBEEK, R; RITTGEN, P.Lecture notes in computer science. 1999, pp 278-292, issn 0302-9743, isbn 3-540-65462-3Conference Paper

Testing semantics for unbounded nondeterminismFDO, L; DIAZ, L; NUNEZ, M et al.Lecture notes in computer science. 1997, pp 538-545, issn 0302-9743, isbn 3-540-63440-1Conference Paper

Script: a communication abstraction mechanism and its verificationNISSIM FRANCEZ; HAILPERN, B; TAUBENFELD, G et al.Science of computer programming. 1986, Vol 6, Num 1, pp 35-88, issn 0167-6423Article

Introduction à OCCAM langage parallèle issu de CSP pour la programmation des systèmes de transinateurs = Introduction to parallel language OCCAM derived from the transputers systems programmingMUNTEAN, Traian.Rapport de recherche - IMAG. 1983, Num 430, issn 0750-7380, 54 p.Report

DEADLOCK DETECTION FOR A CLASS OF COMMUNICATING FINITE STATE MACHINESYAO TIN YU; GOUDA MG.1982; IEEE TRANSACTIONS ON COMMUNICATIONS; ISSN 0090-6778; USA; DA. 1982; VOL. 30; NO 12; PP. 2514-2518; BIBL. 11 REF.Article

A CSP DESCRIPTION OF SOME PARALLEL SORTING ALGORITHMSLINCK MH.sdSOUTH AFRICAN COMPUTER SYMPOSIUM ON RESEARCH IN THEORY, SOFTWARE, HARDWARE. 2/1981/PRETORIA; ZAF; DA. S.D.; 15 P.; BIBL. 12 REF.Conference Paper

CSP, partial automata, and coalgebrasWOLTER, Uwe.Theoretical computer science. 2002, Vol 280, Num 1-2, pp 3-34, issn 0304-3975Conference Paper

Fair bisimulationHENZINGER, T. A; RAJAMANI, S. K.Lecture notes in computer science. 2000, pp 299-314, issn 0302-9743, isbn 3-540-67282-6Conference Paper

Checking for CFFD-preorder with tester processesHELOVUO, J; VALMARI, A.Lecture notes in computer science. 2000, pp 283-298, issn 0302-9743, isbn 3-540-67282-6Conference Paper

On the evolution of reactive components : A process-algebraic approachMÜLLER-OLM, M; STEFFEN, B; CLEAVELAND, R et al.Lecture notes in computer science. 1999, pp 161-175, issn 0302-9743, isbn 3-540-65718-5Conference Paper

Abstraction and testingSCHNEIDER, S.Lecture notes in computer science. 1999, pp 738-757, issn 0302-9743, isbn 3-540-66587-0, 2VolConference Paper

Weakest-congruence results for livelock-preserving equivalencesPUHAKKA, A; VALMARI, A.Lecture notes in computer science. 1999, pp 510-524, issn 0302-9743, isbn 3-540-66425-4Conference Paper

A distributed deadlock detection algorithm for CSP-like communicationSHING-TSAAN HUANG.ACM transactions on programming languages and systems. 1990, Vol 12, Num 1, pp 102-122, issn 0164-0925, 21 p.Article

Consistency-preserving model evolution through transformationsENGELS, Gregor; HECKEL, Reiko; KÜSTER, Jochen M et al.Lecture notes in computer science. 2002, pp 212-226, issn 0302-9743, isbn 3-540-44254-5, 15 p.Conference Paper

A single complete refinement rule for demonic specificationsKERMER, K; STROOPER, P.Lecture notes in computer science. 2000, pp 564-579, issn 0302-9743, isbn 3-540-67823-9Conference Paper

A trace model for pointers and objectsHOARE, C. A. R; JIFENG, H.Lecture notes in computer science. 1999, pp 1-17, issn 0302-9743, isbn 3-540-66156-5Conference Paper

  • Page / 6